Applying machine based decomposition in 2-machine flow shops
نویسندگان
چکیده
منابع مشابه
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved. However, such a procedure has been reported to be highly ineffective for the Flow Shop problems (Jain and Meeran 2002). In particular, we show th...
متن کاملApplying morphological decomposition to statistical machine translation
This paper describes the Aalto submission for the German-to-English and the Czechto-English translation tasks of the ACL 2010 Joint Fifth Workshop on Statistical Machine Translation and MetricsMATR. Statistical machine translation has focused on using words, and longer phrases constructed from words, as tokens in the system. In contrast, we apply different morphological decompositions of words ...
متن کاملApplying Event and Machine Decomposition to a Flash-Based Filestore in Event-B
Event-B is a formal method used for specifying and reasoning about systems. Rodin is a toolset for developing system models in Event-B. Our experiment which is outlined in this paper is aimed at applying Event-B and Rodin to a flash-based filestore. Refinement is a useful mechanism that allows developers to sharpen models step by step. Two uses of refinement, feature augmentation and structural...
متن کاملAn Intelligent Machine Learning-Based Protection of AC Microgrids Using Dynamic Mode Decomposition
An intelligent strategy for the protection of AC microgrids is presented in this paper. This method was halving to an initial signal processing step and a machine learning-based forecasting step. The initial stage investigates currents and voltages with a window-based approach based on the dynamic decomposition method (DDM) and then involves the norms of the signals to the resultant DDM data. T...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2006
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2004.10.028